The numerical treatment of stiff initial value problems
نویسندگان
چکیده
منابع مشابه
Validated Numerical Bounds on the Global Error for Initial Value Problems for Stiff Ordinary Differential Equations
Validated Numerical Bounds on the Global Error for Initial Value Problems for Stiff Ordinary Differential Equations Chao Yu Master of Science Graduate Department of Computer Science University of Toronto 2004 There are many standard numerical methods for initial value problems (IVPs) for ordinary differential equations (ODEs). Compared with these methods, validated methods for IVPs for ODEs pro...
متن کاملComparison of some recent numerical methods for initial-value problems for stiff ordinary differential equations
We consider the combustion equation as one of the candidates from the class of stiff ordinary differential equations. A solution over a length of time that is inversely proportional to δ > 0 (where δ > 0 is a small disturbance of the pre-ignition state) is sought. This problem has a transient at the midpoint of the integration interval. The solution changes from being non-stiff to stiff, and af...
متن کاملTrigonometrically fitted two-step obrechkoff methods for the numerical solution of periodic initial value problems
In this paper, we present a new two-step trigonometrically fitted symmetric Obrechkoff method. The method is based on the symmetric two-step Obrechkoff method, with eighth algebraic order, high phase-lag order and is constructed to solve IVPs with periodic solutions such as orbital problems. We compare the new method to some recently constructed optimized methods from the literature. The numeri...
متن کاملA Non-linear Absolutely-stable Explicit Numerical Integration Algorithm for Stiff Initial-value Problems
The time-step in integration process has two restrictions. The first one is the time step restriction due to accuracy requirement τac and the second one is the time-step restriction due to stability requirement τst. The most of explicit methods have small stability regions and consequently small τst. It obliges us to solve stiff problems with small step size τst << τac. The implicit methods wor...
متن کاملAn automatic multistep method for solving stiff initial value problems
A multistep method with matricial coefficients is developed. It can be used to solve stiff initial value problems of the form y’= Ay + g(x,y). This method bears the nature of the classical Adams-Bashforth-Moulton PC formula and can be shown to be consistent, convergent and A-stable. A careful reformulation of this method legitimatizes the implementation of this algorithm in a variable-step vari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Banach Center Publications
سال: 1984
ISSN: 0137-6934,1730-6299
DOI: 10.4064/-13-1-353-363